On the graphic matroid parity problem
نویسنده
چکیده
A relatively simple proof is presented for the min-max theorem of Lovász on the graphic matroid parity problem.
منابع مشابه
Parallel Complexity for Matroid Intersection and Matroid Parity Problems
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid parity set) is called a basic matroid intersection (basic matroid parity set), if its size is the rank of the matroid. We present that enumerating all basic matroid intersections (basic matroid parity sets) is in NC, provided that there are polynomial bounded basic m...
متن کاملA Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Irreversible k-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or opinions. We show that the problem to find a minimum irreversible 2-conversion set can be solved in O(n2 log6 n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph. Th...
متن کاملA Algebraic Algorithms for Linear Matroid Parity Problems
We present fast and simple algebraic algorithms for the linear matroid parity problem and its applications. For the linear matroid parity problem, we obtain a simple randomized algorithm with running time O(mrω−1) where m and r are the number of columns and the number of rows and ω ≈ 2.3727 is the matrix multiplication exponent. This improves the O(mrω)-time algorithm by Gabow and Stallmann, an...
متن کاملSolving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems
In this paper, we present an O(r n) algorithm for the linear matroid parity problem. Our solution technique is to introduce a modest generalization, the non-simple parity problem, and identify an important subclass of non-simple parity problems called 'easy' parity problems which can be solved as matroid intersection problems. We then show how to solve any linear matroid parity problem parametr...
متن کاملOn the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ 2 . In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be Σ 2 -complete and is coNPhard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 88 شماره
صفحات -
تاریخ انتشار 2003